首页> 外文OA文献 >Extracting useful rules through improved decision tree induction using information entropy
【2h】

Extracting useful rules through improved decision tree induction using information entropy

机译:使用改进的决策树归纳提取有用的规则   信息熵

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Classification is widely used technique in the data mining domain, wherescalability and efficiency are the immediate problems in classificationalgorithms for large databases. We suggest improvements to the existing C4.5decision tree algorithm. In this paper attribute oriented induction (AOI) andrelevance analysis are incorporated with concept hierarchys knowledge andHeightBalancePriority algorithm for construction of decision tree along withMulti level mining. The assignment of priorities to attributes is done byevaluating information entropy, at different levels of abstraction for buildingdecision tree using HeightBalancePriority algorithm. Modified DMQL queries areused to understand and explore the shortcomings of the decision trees generatedby C4.5 classifier for education dataset and the results are compared with theproposed approach.
机译:分类是数据挖掘领域中广泛使用的技术,可伸缩性和效率是大型数据库分类算法中的直接问题。我们建议对现有的C4.5决策树算法进行改进。本文将面向属性的归纳(AOI)和相关性分析与概念层次知识和HeightBalance优先级算法结合在一起,用于决策树的构建以及多级挖掘。通过使用HeightBalancePriority算法在建筑决策树的不同抽象级别上评估信息熵来完成对属性的优先级分配。修改后的DMQL查询用于理解和探索由C4.5分类器生成的教育数据集决策树的缺点,并将结果与​​提出的方法进行比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号